A Peer-based Recovery Scheme for Group Rekeying in Secure Multicast
نویسندگان
چکیده
The Logical Key Hierarchy (LKH) provides a scalable and efficient way to distribute session keys to authorized group members in secure group (multicast) communication. However, because multicast is a best-effort service, it requires additional mechanism to ensure that every member receives the rekey information. To solve this problem, several FEC-based schemes have been proposed. Although these schemes significantly enhance the reliability of the rekey transmissions, they require significant additional resources at the key server. In this paper we propose a distributed scheme for recovering lost rekey packets. Our scheme allows each member to contact other members to get the missing packets during rekey events, thus avoiding the extra computation and bandwidth resources at the key server. We compare our scheme with a well-known FEC scheme with respect to latencies experienced by receivers in reasonably large groups. Results show that our scheme yields lower average and 95thpercentile latencies than the FEC-based scheme across several operating regimes.
منابع مشابه
Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network
In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for multicast communication on joining the member. Secondly, the rekeying scheme generates a huge comm...
متن کاملA Lightweight Prepositioned Secret Sharing Tree for Multicast Key Management
Secure group communications are increasingly used in the continuous growth of the Internet applications. In a secure multicast environment, an identical data can be efficiently delivered from a source to multiple receivers within a dynamic group. A simple solution is to encrypt the transmitted data using a symmetric key. However, scalable group rekeying is the main challenge for large and dynam...
متن کاملAn Adaptive Hybrid Rekeying Protocol for Dynamic Multicast Groups
In secure multi-party communications, the Logical Key Hierarchy scheme has been proved to be communication optimal for large groups. However, this scheme still suffers from an expensive rekeying cost when the group is very dynamic. To reduce the rekeying cost, Zhu et al. suggested to partition the logical key tree in two sub-trees based on the duration of each member in the multicast group. Alt...
متن کاملAdding Reliable and Self-healing Key Distribution to the Subset Difference Group Rekeying Method for Secure Multicast
We study two important issues related to the Subset Difference Rekeying (SDR) method [4]. First, we present a reliable key distribution scheme, called WFEC-BKR, that enables members to receive the current group key in a reliable and timely fashion inspite of packet losses in the network. Through simulation, we show that in most scenarios, WFEC-BKR outperforms previously proposed schemes for rel...
متن کاملPerformance Optimizations for Group Key Management Schemes for Secure Multicast
Scalable group rekeying is one of the biggest challenges that need to be addressed to support secure communications for large and dynamic groups. In recent years, many group key management approaches based on the use of logical key trees have been proposed to address this issue. Using logical key trees reduces the complexity of group rekeying operation from O(N) to O(logN), where N is the group...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 6 شماره
صفحات -
تاریخ انتشار 2008